A Parallel Adaptive version of the Block-based Gauss-Jordan Algorithm
نویسندگان
چکیده
This paper presents a parallel adaptive version of the block-based Gauss-Jordan algorithm used in numerical analysis to invert matrices. This version includes a characterization of the workload of processors and a mechanism of its adaptive folding/unfolding. The application is implemented and experimented with MARS in dedicated and non-dedicated environments. The results show that an absolute efficiency of 92% is possible on a cluster of DEC/ALPHA processors interconnected by a Gigaswitch network and an absolute efficiency of 67% can be obtained on an Ethernet network of SUN-Sparc4 workstations. Moreover, the adaptability of the algorithm is experimeted on a non-dedicated meta-system including both the two parks of machines.
منابع مشابه
A new parallel adaptive block - based Gauss - Jordan
Parallelism in adaptive execution environments requires a parallel adaptive programming methodology. In this paper, we present this methodology on the block-based Gauss-Jordan algorithm used in numeric analysis to solve linear systems. The application includes a work scheduling strategy and is in some way fault tolerant. It is implemented and experimented with the MARS parallel adaptive program...
متن کاملParallel processing on block-based Gauss-Jordan algorithm for desktop grid
Two kinds of parallel possibilities exist in the block-based Gauss-Jordan (BbGJ) algorithm, which are intra-step and inter-steps based parallelism. But the existing parallel paradigm of BbGJ algorithm just aiming at the intra-step based parallelism, can‟t meet the requirement of dispatching simultaneously as many tasks as possible to computing nodes of desktop grid platform exploiting thousands...
متن کاملA Parallel Matrix Inversion Algorithm on Torus with Adaptive Pivoting
This paper presents a parallel algorithm for matrix inversion on a torus interconnected MIMD-MC multi-processor. This method is faster than the parallel implementations of other widely used methods namely Gauss-Jordan, Gauss-Seidal or LU decomposition based inversion. This new algorithm also introduces a novel technique, called adaptive pivoting, for solving the zero pivot problem at no cost. O...
متن کاملMeasuring the Overhead of Intel C++ CnC over TBB for Gauss-Jordan Elimination
The most efficient parallel execution of dense liner algebra algorithms is to build and evaluate the task graph constrained only by the data dependencies between the tasks. Both Intel C++ Concurrent Collections (CnC) and Threading Building Blocks (TBB) libraries allow such task-based parallel programming. In this paper, we first analyze all the three types of data dependencies in the tiled in-p...
متن کاملPerformance Bounds for Column-block Partitioning of Parallel Gaussian Elimination and Gauss-jordan Methods
Column-block partitioning is commonly used in the parallelization of Gaussian-Elimination(GE) and Gauss-Jordan(GJ) algorithms. It is therefore of interest to know performance bounds of such partitioning on scalable distributed-memory parallel architectures. In this paper, we use a graph-theoretic approach in deriving asymptotic performance lower bounds of column-block partitioning for both GE a...
متن کامل